A = [45, 4, 2, 5, 65, 35, 18, 97, 18, 49, 65, 5, 6, 7, 3, 0]
print(f'原本列表：{A}')
def insertionsort(A):
    for i in range(1, len(A)):
        for j in range(i):
            if A[i] <= A[j]:
                a = A[i]
                A[i] = A[j]
                A[j] = a
    return A


B = insertionsort(A)
print(f'排序后列表：{B}')
